A Numerical Analyst Looks at the "Cutoff Phenomenon" in Card Shuffling and Other Markov Chains
نویسندگان
چکیده
Acknowledgement This paper was prompted in part by an inspiring course taught at Cornell by Persi Diaconis in the fall of 1996. For help and advice along the way we are grateful to Diaconis and to 29 References 1] D. Bayer and P. Diaconis, \Trailing the dovetail shuue to its lair," Ann. Appl. \Asymptotic analysis of a random walk on a hypercube with many dimensions," Random Struct. and Alg.
منابع مشابه
The cutoff phenomenon in finite Markov chains.
Natural mixing processes modeled by Markov chains often show a sharp cutoff in their convergence to long-time behavior. This paper presents problems where the cutoff can be proved (card shuffling, the Ehrenfests' urn). It shows that chains with polynomial growth (drunkard's walk) do not show cutoffs. The best general understanding of such cutoffs (high multiplicity of second eigenvalues due to ...
متن کاملCutoff for non-backtracking random walks on sparse random graphs
Reduced `-cohomology in degree 1 (for short "LpR1") is a useful quasiisometry invariant of graphs [of bounded valency] whose definition is relatively simple. On a graph, there is a natural gradient operator from functions to vertices to functions on edges defined by looking at the difference of the value on the extremities of the edge. Simply put, this cohomology is the quotient of functions wi...
متن کاملHopf algebras and Markov chains: Two examples and a theory
The operation of squaring (coproduct followed by product) in a combinatorial Hopf algebra is shown to induce a Markov chain in natural bases. Chains constructed in this way include widely studied methods of card shuffling, a natural “rock-breaking” process, and Markov chains on simplicial complexes. Many of these chains can be explictly diagonalized using the primitive elements of the algebra a...
متن کاملConvergence Time to the Ewens Sampling Formula
In this paper, we establish the cutoff phenomena for the discrete time infinite alleles Moran model. If M is the population size and μ is the mutation rate, we find a cutoff time of log(Mμ)/μ generations. The stationary distribution for this process in the case of sampling without replacement is the Ewens sampling formula. We show that the bound for the total variation distance from the generat...
متن کاملCard-Shuffling Analysis with Markov Chains
In this essay we shall discuss mathematical models of card-shuffling. The basic question to answer is ”how many times do you need to shuffle a deck of cards for it to become sufficiently randomized?”. This obviously depends on what we mean by shuffling and sufficiently randomized so we shall dwell quite a bit on these points too. In section 2 we will name and describe some popular shuffles. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007